Conjunctive Query Answering with OWL 2 QL
نویسندگان
چکیده
We present a novel rewriting technique for conjunctive query answering over OWL 2 QL ontologies. In general, the obtained rewritings are not necessarily correct and can be of exponential size in the length of the query. We argue, however, that in most, if not all, practical cases the rewritings are correct and of polynomial size. Moreover, we prove some sufficient conditions, imposed on queries and ontologies, that guarantee correctness and succinctness. We also support our claim by experimental results.
منابع مشابه
Combined Complexity of Answering Tree-like Queries in OWL 2 QL
Introduction The OWL 2 QL ontology language [11], based upon the description logic DL-LiteR, is considered particularly well suited for applications involving large amounts of data. While the data complexity of querying OWL 2 QL knowledge bases is well understood, far less is known about combined complexity of conjunctive query (CQ) answering for restricted classes of conjunctive queries. By co...
متن کاملSchema-Agnostic Query Rewriting in SPARQL 1.1
SPARQL 1.1 supports the use of ontologies to enrich query results with logical entailments, and OWL 2 provides a dedicated fragment OWL QL for this purpose. Typical implementations use the OWL QL schema to rewrite a conjunctive query into an equivalent set of queries, to be answered against the non-schema part of the data. With the adoption of the recent SPARQL 1.1 standard, however, RDF databa...
متن کاملPractical Querying of Temporal Data via OWL 2 QL and SQL: 2011
We develop a practical approach to querying temporal data stored in temporal SQL:2011 databases through the semantic layer of OWL 2 QL ontologies. An interval-based temporal query language (TQL), which we propose for this task, is defined via naturally characterizable combinations of temporal logic with conjunctive queries. This foundation warrants well-defined semantics and formal properties o...
متن کاملQuery Rewriting Under Query Extensions for OWL 2 QL Ontologies
Conjunctive query answering is a key reasoning service for many ontology-based applications. With the advent of lightweight ontology languages, such as OWL 2 QL, several query answering systems have been proposed which compute the so called UCQ rewriting of a given query. It is often the case in realistic scenarios, that users refine their original queries, by e.g., extending them with new cons...
متن کاملOn the Parametrised Complexity of Tree-Shaped Ontology-Mediated Queries in OWL 2 QL
We discuss the parameterised complexity of answering tree-shaped ontology-mediated queries (OMQs) in OWL 2 QL under various restrictions on their ontologies and conjunctive queries (CQs). In particular, we construct an ontology T such that answering OMQs (T , q) with tree-shaped CQs q is W[1]hard if the number of leaves in q is regarded as the parameter. The number of leaves has previously been...
متن کامل